Uniqueness Typing in Natural Deduction Style
نویسندگان
چکیده
We present two type systems for graph rewriting: conventional typing and (polymorphic) uniqueness typing. The latter is introduced as a natural extension of simple algebraic and higher-order uniqueness typing. The systems are given in natural deduction style using an inductive syntax of graph denotations with familiar constructs such as let and case. The conventional system resembles traditional Curry-style typing systems in functional programming languages. Uniqueness typing extends this with reference count information. In both type systems, typing is preserved during evaluation, and types can be determined effectively. Due to the present formalization, the system can easily be compared with other proposals based on linear and affine logic.
منابع مشابه
Derivation System for Uniqueness TypingErik
We present two systems for rst-order typing of graph expressions, in natural deduction style: conventional typing and (polymorphic) uniqueness typing. In both type systems, typing is preserved during evaluation, and types can be determined eeectively.
متن کاملUniqueness Typing for Functional Languages with Graph Rewriting Semantics
We present two type systems for term graph rewriting: conventional typing and (polymorphic) uniqueness typing. The latter is introduced as a natural extension of simple algebraic and higher-order uniqueness typing. The systems are given in natural deduction style using an inductive syntax of graph denotations with familiar constructs such as let and case. The conventional system resembles tradi...
متن کاملProducts and Polymorphic Subtypes
This paper is devoted to a comprehensive study of polymorphic subtypes with products. We first present a sound and complete Hilbert style axiomatization of the relation of being a subtype in presence of !; type constructors and the 8 quantifier, and we show that such axiomatization is not encodable in the system with !;8 only. In order to give a logical semantics to such a subtyping relation, w...
متن کاملNon-idempotent types for classical calculi in natural deduction style
In the first part of this paper, we define two resource aware typing systems for the λμ-calculus based on non-idempotent intersection and union types. The nonidempotent approach provides very simple combinatorial arguments –based on decreasing measures of type derivations– to characterize head and strongly normalizing terms. Moreover, typability provides upper bounds for the lengths of the head...
متن کاملA binary modal logic for the intersection types of lambda-calculus
Intersection types discipline allows to define a wide variety of models for the type free lambda-calculus, but the Curry-Howard isomorphism breaks down for this kind of type systems. In this paper we show that the correspondence between types and suitable logical formulas can still be recovered appealing to the fact that there is a strict connection between the semantics for lambda-calculus ind...
متن کامل